The weighted shortest path search based on multi‐agents in mobile GIS management services
Identifieur interne : 000552 ( Main/Exploration ); précédent : 000551; suivant : 000553The weighted shortest path search based on multi‐agents in mobile GIS management services
Auteurs : Min Peng [République populaire de Chine] ; Naixue Xiong [États-Unis] ; Jong Hyuk Park [Corée du Sud] ; Athanasios V. Vasilakos [Grèce] ; Jiawen Zhang [République populaire de Chine]Source :
- Wireless Communications and Mobile Computing [ 1530-8669 ] ; 2012-03.
English descriptors
- KwdEn :
Abstract
In this paper we focus on the mobile GIS management system based on multi‐agents, and wider range of client devices with J2ME‐MIDP kernel are supported in it. A kit (Map Database Manager) is developed and described in detail. The kit can convert GIS data of commercial formats such as ArcGIS and Mapinfo into Geospatial data in GML, and provide Geospatial data for handheld devices freely without commercial plug‐in software. A peer to peer multi‐agents mechanism on mobile GIS services is the main subject of this paper. According to user's requirement and known buffer area radius on map, agent can define the factors to calculate the optimal path from one node to target node in a map, which considers not only the length of the road but also traffic flow, road cost, and other factors. We use the integrated cost to re‐define the road path weights, and select the optimal path among the road based on the minimum weight. The actual experimental results shown that in the quantified traffic flow and road condition, from node to other target nodes, we can get an optimal path on map, which satisfies the condition mostly. The results can greatly assist the searching of the optimal path in GIS services. Copyright © 2010 John Wiley & Sons, Ltd.
Url:
DOI: 10.1002/wcm.962
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000762
- to stream Istex, to step Curation: 000762
- to stream Istex, to step Checkpoint: 000071
- to stream Main, to step Merge: 000553
- to stream Main, to step Curation: 000552
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The weighted shortest path search based on multi‐agents in mobile GIS management services</title><author><name sortKey="Peng, Min" sort="Peng, Min" uniqKey="Peng M" first="Min" last="Peng">Min Peng</name></author><author><name sortKey="Xiong, Naixue" sort="Xiong, Naixue" uniqKey="Xiong N" first="Naixue" last="Xiong">Naixue Xiong</name></author><author><name sortKey="Park, Jong Hyuk" sort="Park, Jong Hyuk" uniqKey="Park J" first="Jong Hyuk" last="Park">Jong Hyuk Park</name></author><author><name sortKey="Vasilakos, Athanasios V" sort="Vasilakos, Athanasios V" uniqKey="Vasilakos A" first="Athanasios V." last="Vasilakos">Athanasios V. Vasilakos</name></author><author><name sortKey="Zhang, Jiawen" sort="Zhang, Jiawen" uniqKey="Zhang J" first="Jiawen" last="Zhang">Jiawen Zhang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3EDE1C6C7D62130F1B6AB7FF4ED5CD2BF9FCA034</idno><date when="2012" year="2012">2012</date><idno type="doi">10.1002/wcm.962</idno><idno type="url">https://api.istex.fr/document/3EDE1C6C7D62130F1B6AB7FF4ED5CD2BF9FCA034/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000762</idno><idno type="wicri:Area/Istex/Curation">000762</idno><idno type="wicri:Area/Istex/Checkpoint">000071</idno><idno type="wicri:doubleKey">1530-8669:2012:Peng M:the:weighted:shortest</idno><idno type="wicri:Area/Main/Merge">000553</idno><idno type="wicri:Area/Main/Curation">000552</idno><idno type="wicri:Area/Main/Exploration">000552</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The weighted shortest path search based on multi‐agents in mobile GIS management services</title><author><name sortKey="Peng, Min" sort="Peng, Min" uniqKey="Peng M" first="Min" last="Peng">Min Peng</name><affiliation wicri:level="1"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>Department of Computer Science, State Key Lab of Software Engineering, Wuhan University, Wuhan</wicri:regionArea><wicri:noRegion>Wuhan</wicri:noRegion></affiliation></author><author><name sortKey="Xiong, Naixue" sort="Xiong, Naixue" uniqKey="Xiong N" first="Naixue" last="Xiong">Naixue Xiong</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Georgia State University, Atlanta, GA</wicri:regionArea><placeName><region type="state">Géorgie (États-Unis)</region></placeName></affiliation></author><author><name sortKey="Park, Jong Hyuk" sort="Park, Jong Hyuk" uniqKey="Park J" first="Jong Hyuk" last="Park">Jong Hyuk Park</name><affiliation wicri:level="3"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Seoul National University of Technology, Seoul</wicri:regionArea><placeName><settlement type="city">Séoul</settlement></placeName></affiliation></author><author><name sortKey="Vasilakos, Athanasios V" sort="Vasilakos, Athanasios V" uniqKey="Vasilakos A" first="Athanasios V." last="Vasilakos">Athanasios V. Vasilakos</name><affiliation wicri:level="1"><country xml:lang="fr">Grèce</country><wicri:regionArea>Department of Computer and Telecommunications Engineering, University of Western Macedonia</wicri:regionArea><wicri:noRegion>University of Western Macedonia</wicri:noRegion></affiliation></author><author><name sortKey="Zhang, Jiawen" sort="Zhang, Jiawen" uniqKey="Zhang J" first="Jiawen" last="Zhang">Jiawen Zhang</name><affiliation wicri:level="1"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>Department of Computer Science, State Key Lab of Software Engineering, Wuhan University, Wuhan</wicri:regionArea><wicri:noRegion>Wuhan</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Wireless Communications and Mobile Computing</title><title level="j" type="abbrev">Wirel. Commun. Mob. Comput.</title><idno type="ISSN">1530-8669</idno><idno type="eISSN">1530-8677</idno><imprint><publisher>John Wiley & Sons, Ltd.</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2012-03">2012-03</date><biblScope unit="volume">12</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="302">302</biblScope><biblScope unit="page" to="317">317</biblScope></imprint><idno type="ISSN">1530-8669</idno></series><idno type="istex">3EDE1C6C7D62130F1B6AB7FF4ED5CD2BF9FCA034</idno><idno type="DOI">10.1002/wcm.962</idno><idno type="ArticleID">WCM962</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1530-8669</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>handheld device</term><term>mobile GIS</term><term>multi‐agents</term><term>optimal path search</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper we focus on the mobile GIS management system based on multi‐agents, and wider range of client devices with J2ME‐MIDP kernel are supported in it. A kit (Map Database Manager) is developed and described in detail. The kit can convert GIS data of commercial formats such as ArcGIS and Mapinfo into Geospatial data in GML, and provide Geospatial data for handheld devices freely without commercial plug‐in software. A peer to peer multi‐agents mechanism on mobile GIS services is the main subject of this paper. According to user's requirement and known buffer area radius on map, agent can define the factors to calculate the optimal path from one node to target node in a map, which considers not only the length of the road but also traffic flow, road cost, and other factors. We use the integrated cost to re‐define the road path weights, and select the optimal path among the road based on the minimum weight. The actual experimental results shown that in the quantified traffic flow and road condition, from node to other target nodes, we can get an optimal path on map, which satisfies the condition mostly. The results can greatly assist the searching of the optimal path in GIS services. Copyright © 2010 John Wiley & Sons, Ltd.</div></front></TEI><affiliations><list><country><li>Corée du Sud</li><li>Grèce</li><li>République populaire de Chine</li><li>États-Unis</li></country><region><li>Géorgie (États-Unis)</li></region><settlement><li>Séoul</li></settlement></list><tree><country name="République populaire de Chine"><noRegion><name sortKey="Peng, Min" sort="Peng, Min" uniqKey="Peng M" first="Min" last="Peng">Min Peng</name></noRegion><name sortKey="Zhang, Jiawen" sort="Zhang, Jiawen" uniqKey="Zhang J" first="Jiawen" last="Zhang">Jiawen Zhang</name></country><country name="États-Unis"><region name="Géorgie (États-Unis)"><name sortKey="Xiong, Naixue" sort="Xiong, Naixue" uniqKey="Xiong N" first="Naixue" last="Xiong">Naixue Xiong</name></region></country><country name="Corée du Sud"><noRegion><name sortKey="Park, Jong Hyuk" sort="Park, Jong Hyuk" uniqKey="Park J" first="Jong Hyuk" last="Park">Jong Hyuk Park</name></noRegion></country><country name="Grèce"><noRegion><name sortKey="Vasilakos, Athanasios V" sort="Vasilakos, Athanasios V" uniqKey="Vasilakos A" first="Athanasios V." last="Vasilakos">Athanasios V. Vasilakos</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000552 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000552 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3EDE1C6C7D62130F1B6AB7FF4ED5CD2BF9FCA034
|texte= The weighted shortest path search based on multi‐agents in mobile GIS management services
}}
| This area was generated with Dilib version V0.6.25. |  |